On reducing computational effort in topology optimization: we can go at least this far!
نویسندگان
چکیده
منابع مشابه
Sugarcane improvement: how far can we go?
In recent years, efforts to improve sugarcane have focused on the development of biotechnology for this crop. It has become clear that sugarcane lacks tools for the biotechnological route of improvement and that the initial efforts in sequencing ESTs had limited impact for breeding. Until recently, the models used by breeders in statistical genetics approaches have been developed for diploid or...
متن کاملHow Far Can We Go on the x64 Processors?
This paper studies the state-of-the-art software optimization methodology for symmetric cryptographic primitives on the new 64-bit x64 processors, AMD Athlon64 (AMD64) and Intel Pentium 4 (EM64T). We fully utilize newly introduced 64-bit registers and instructions for extracting maximal performance of target primitives. Our program of AES with 128-bit key runs in 170 cycles/block on Athlon 64, ...
متن کاملCan we at least agree on something?
During a session of the INEX 2006 workshop in Schloss Dagstuhl the first at-INEX experiment was run. Participants were asked to assess topics in order to increase the number of multiple assessed topics available for analysis (and in order to increase the number of assessors per topic). This contribution presents the experimental set-up, the experiment, and an analysis of the results. When exami...
متن کاملHow far can we go in distributed hydrological modelling?
This paper considers distributed hydrological models in hydrology as an expression of a pragmatic realism. Some of the problems of distributed modelling are discussed including the problem of nonlinearity, the problem of scale, the problem of equifinality, the problem o f uniqueness and the problem of uncertainty. A structure for the application of distributed modelling is suggested based on an...
متن کاملHow Far Can We Go Beyond Linear Cryptanalysis?
Several generalizations of linear cryptanalysis have been proposed in the past, as well as very similar attacks in a statistical point of view. In this paper, we define a rigorous general statistical framework which allows to interpret most of these attacks in a simple and unified way. Then, we explicitely construct optimal distinguishers, we evaluate their performance, and we prove that a bloc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Structural and Multidisciplinary Optimization
سال: 2018
ISSN: 1615-147X,1615-1488
DOI: 10.1007/s00158-018-2121-1